Microsoft Word - C 1
نویسندگان
چکیده
In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in MANET turns into dynamic optimization problem (DOP). Here the nodes ae made aware of the environmental condition, thereby making it intelligent, which goes as the input for GA. The implementation then uses GAs with immigrants and memory schemes to solve the dynamic SP routing problem (DSPRP) in MANETS. In our paper, once the network topology changes, the optimal solutions in the new environment can be searched using the new immigrants or the useful information stored in the memory. Results shows GA with new immigrants shows better convergence result than GA with memory scheme.
منابع مشابه
Microsoft Word - Karamloo-Text.docx
: ' 1 ! "# & 23 4 '( ) * +,) ! .!/ # 5 # 6 7289 # '( :; < =(> ? ) ( & > @A @! # B< ' & (% # C # D ! . &# E 5 1 F5 ! # # # " % &# E 5 # F5 ! # . # " % 6 5 G E % . # " % $ "# H # # ) ( ( KL ! 9 >M$ + N + >M$ O 4 P Q & " % $ # . "# # "# 4 T ! 1(MRA -/SA K T 1: > . : ! UQ /E ? S> & O ( )...
متن کاملMicrosoft Word - NEF485BF
Prof. Dr. H. Schiffl, Medizinische Klinik, Klinikum Innenstadt der Ludwig-Maximilians-Universität, Zíemssenstrasse 1, D80336 München (Germany) Table 1. Effect of C. orellanus ingestion on renal function Bouget et al. ‚ Grzy mala, 1957,199
متن کاملMicrosoft Word - JBC manuscript 09-1-13
Background: The functional importance of C2 insert containing isoform of nonmuscle myosin II-C is not known.
متن کاملMicrosoft Word - 73999710-file00.docx
List of non-standard abbreviations ATSDR Agency for Toxic Substances and Disease Registry GSK-3β Glycogen synthase kinase-3β Kim-1 Kidney injury molecule-1 RT-PCR Reverse transcriptase polymerase chain reaction
متن کاملA loopless and branchless $O(1)$ algorithm to generate the next Dyck word
Let integer be any C/C++ unsigned integer type up to 64-bits long. Given a Dyck word the following code returns the next Dyck word of the same size, provided it exists. integer next_dyck_word(integer w) { integer const a = w & -w; integer const b = w + a; integer c = w ^ b; c = (c / a >> 2) + 1; c = ((c * c 1) & 0xaaaaaaaaaaaaaaaa) | b; return c; }
متن کامل